package com.zelix;

import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;

public final class lu extends ju
{

    private static String z[];

    lu(lt lt1, zs zs1, zs zs2, pt apt[]) {
        super(lt1, zs1, zs2, apt);
        int i;
        for (i = 0; i < apt.length; i++) {
            apt[i].a(this);
        }
    }

    lu(kt kt1, jb jb, qy qy, qy qy1, PrintWriter printwriter, ty ty)
        throws IOException, dc, tb {
        super(kt1, jb, qy, printwriter);
        int i;
        super.o = new pt[super.n];
        for (i = 0; i < super.o.length; i++) {
            super.o[i] = pt.a(this, jb, qy, qy1, printwriter, null, ty);
        }
        if (is.b(q(), true) == null) {
            printwriter.println(i() + z[9] + z[8]);
            b(false);
        } else {
            b(true);
        }
    }

    void a(String s, String s1, fy fy1, mt mt, it it1) {
        String s2;
        String s3;
        String s4;
        String s5;
        StringBuffer stringbuffer;
        s2 = j();
        s3 = u();
        s4 = s3.substring(s.length());
        s5 = s1 + s4;
        if (it1.c(s2, s5)) {
            stringbuffer = new StringBuffer();
            if (s4.length() > 0) {
                for (int i = s4.length() - 1; i >= 0; i--) {
                    char c1 = s4.charAt(i);
                    if (Character.isDigit(c1))
                        stringbuffer.insert(0, c1);
                }
            }

            String s6 = s5.substring(0, s5.length() - stringbuffer.length());
            int j = -1;
            if (stringbuffer.length() > 0)
                try {
                    j = Integer.parseInt(stringbuffer.toString());
                }
                catch (NumberFormatException _ex) {
                }
            do {
                j++;
                s5 = s6 + j;
            } while (it1.c(s2, s5));
        }

        b(s5);
        it1.a(mt, this, s3);
        fy1.b(s2, s3, s5);
    }

    public mt P()
    {
        String s = lt.d(q());
        if(s != null)
            return fh.a(s);
        else
            return null;
    }

    st Q() {
        int i;
        for (i = 0; i < super.o.length; i++) {
            if (super.o[i] instanceof st) {
                return (st) super.o[i];
            }
        }
        return null;
    }

    public static String c(String s) {
        String s1;
        int i;
        if ((i = s.lastIndexOf("/")) != -1) {
            s1 = s.substring(i + 1);
        } else {
            s1 = s;
        }
        StringBuffer stringbuffer;
        char c1;
        s1 = zu.a(s1, z[7], z[5]);
        c1 = Character.toUpperCase(s1.charAt(0));
        if (c1 == 'A') {
            stringbuffer = new StringBuffer(z[6]);
        } else if (c1 == 'E') {
            stringbuffer = new StringBuffer(z[6]);
        } else if (c1 == 'I') {
            stringbuffer = new StringBuffer(z[6]);
        } else if (c1 == 'O') {
            stringbuffer = new StringBuffer(z[6]);
        } else if (c1 == 'U') {
            stringbuffer = new StringBuffer(z[6]);
        } else {
            stringbuffer = new StringBuffer("a");
        }
        stringbuffer.append(c1 + s1.substring(1));
        return stringbuffer.toString();
    }

    public boolean S()
    {
        return super.m.b().equals(z[10]);
    }

    void a(HashSet hashset, HashSet hashset1, HashSet hashset2) {
        int i;
        for (i = 0; i < super.o.length; i++) {
            if (super.o[i] instanceof st) {
                ((st) super.o[i]).b(hashset2);
            } else if (super.o[i] instanceof j5)
                ((j5) super.o[i]).a(hashset2);
        }
    }

    public boolean T()
    {
        st st1 = null;
        pt apt[] = new pt[super.o.length - 1];
        int i = 0;
        for(int j = 0; j < super.o.length; j++)
        {
            if(super.o[j] instanceof st)
            {
                st1 = (st)super.o[j];
            }else
            if(i < apt.length)
                apt[i++] = super.o[j];
        }

        if(st1 != null)
        {
            super.o = apt;
            super.n = super.o.length;
            return true;
        } else
        {
            return false;
        }
    }

    public void a(int i, fy fy1, Hashtable hashtable) {
        ArrayList arraylist;
        int j;
        String s = j();
        String s1 = u();
        if (i != 1 && (i != 2 || !fy1.a(s, s1) || fy1.b(s, s1).equals(s1))) {
        } else {
            arraylist = new ArrayList(super.o.length);
            for (j = 0; j < super.o.length; j++) {
                if (super.o[j] instanceof yt) {
                    ((yt) super.o[j]).a(hashtable);
                } else {
                    arraylist.add(super.o[j]);
                }
            }
            if (arraylist.size() < super.o.length) {
                pt apt[] = new pt[arraylist.size()];
                super.o = (pt[]) arraylist.toArray(apt);
                super.n = super.o.length;
            }
            if (c())
                e(false);
        }
    }

    void a(fh fh1, mo mo1, fy fy1, fy fy2, Hashtable hashtable, qy qy, qy qy1, 
            Hashtable hashtable1, Hashtable hashtable2, String s, dd dd, HashMap hashmap, HashMap hashmap1, Hashtable hashtable3, 
            fy fy3, fy fy4)
    {
label0:
        {
            String s1 = u();
            String s2 = O();
            if(dd.a(this))
                return;
            String s3 = null;
            if(hashtable2 == null || (s3 = (String)hashtable2.get(this)) == null)
            {
                String s4 = b();
                s3 = mo1.a(fh1, this, s1, s2, s4, hashtable, qy, qy1, hashtable1, F(), hashmap, hashmap1, fy3, fy4);
            }
            if(s3 != null && !s3.equals(s1))
            {
                l5 l5_1 = new l5(s1, q());
                l5 l5_2 = new l5(s3, q());
                fy1.b(s, l5_1, l5_2);
                l5 l5_3 = (l5)fy2.b(s, l5_2, l5_1);
                if(l5_3 != null)
                    lx.b(false, z[3] + lt.a((String)px.a(s, hashtable3)) + z[2] + l5_1.b() + z[0] + l5_3.b() + z[4] + l5_2.b() + z[1]);
                hashmap1.put(this, s3);
                b(s3);
            }else{
            hashmap1.put(this, s1);
            }
        }
    }

    public boolean U() {
        int i;
        for (i = 0; i < super.o.length; i++) {
            if (super.o[i] instanceof st) {
                st st1 = (st) super.o[i];
                ys ys1 = st1.t();
                if (ys1 != null) {
                    ys1.a("");
                    return true;
                } else {
                    return false;
                }
            }
        }
        return false;
    }

    private static String z(char[] chs) {
        byte key;
        for (int i = 0; i < chs.length; i++) {
            switch (i % 5) {
                case 0:
                    key = 4;
                    break;
                case 1:
                    key = 32;
                    break;
                case 2:
                    key = 100;
                    break;
                case 3:
                    key = 14;
                    break;
                default:
                    key = 4;
                    break;
            }
            chs[i] ^= key;
        }
        return new String(chs).intern();
    }

    static 
    {
        String as[] = new String[11];
        as[0] = "$A\nj$";
        as[1] = "#\016";
        as[2] = "*\000&apl\0";
        as[3] = "@U\024bmgA\020k$bI\001b`$N\005ca$I\n.ghA\027}$";
        as[4] = "$R\001`eiE\000.pk\000C";
        as[5] = "ER\026o}";
        as[6] = "eN";
        as[7] = "_}";
        as[8] = "MN\022ohmDDHmaL\000.@aS\007|mtT\013|";
        as[9] = "$\032D";
        as[10] = "HJ\005xe+L\005`c+s\020|mjG_";
        for (int i = 0; i < as.length; i++) {
            as[i] = z(as[i].toCharArray());
        }
        z = as;
    }
}